package com.singzi.leetcode.N800;

public class T0741 {
    public static void main(String[] args) {

    }
}
class Solution {
    public int cherryPickup(int[][] grid) {
        if(grid[0][0] == -1) return -1;
        int m = grid.length;
        int n = grid[0].length;
        int [][]dp = new int[m][n];
        dp[0][0] = grid[0][0];
        for(int i = 1;i < n;i++){
            if(grid[0][i] != -1) dp[0][i] = dp[0][i-1] + grid[0][i];
        }
        for(int i = 1;i < n;i++){
            if(grid[i][0] != -1) dp[i][0] = dp[i-1][0] + grid[i][0];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if(dp[i][j] != -1) dp[i][j]  = Math.max(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }
        return 0;

    }
}